Sparse Hensel Lifting
نویسنده
چکیده
A new algorithm is introduced which computes the multivariate leading coefficients of polynomial factors from their univariate images. This algorithm is incorporated into a sparse Hensel lifting scheme and only requires the factorization of a single univariate image. The algorithm also provides the content of the input polynomial in the main variable as a by-product. We show how we can take advantage of this property when computing the GCD of multivariate polynomials by sparse Hensel lifting.
منابع مشابه
Newton-Hensel Interpolation Lifting
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a prime number p 6= 2 to a power pk for any k , and its originality is that it is a mixed version that not only lifts the coefficients of the polynomial but also its exponents. We show that this result corresponds exac...
متن کاملUsing Sparse Interpolation in Hensel Lifting
The standard approach to factor a multivariate polynomial in Z[x1, x2, . . . , xn] is to factor a univariate image in Z[x1] then lift the factors of the image one variable at a time using Hensel lifting to recover the multivariate factors. At each step one must solve a multivariate polynomial Diophantine equation. For polynomials in many variables with many terms we find that solving these mult...
متن کاملHensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
متن کاملAn efficient sparse adaptation of the polytope method over I and a record-high binary bivariate factorisation
A recent bivariate factorisation algorithm appeared in (Abu-Salem et al., 2004) based on the use of Newton polytopes and a generalisation of Hensel lifting. Although possessing a worst case exponential running time like the Hensel lifting algorithm, the polytope method should perform well for sparse polynomials whose Newton polytopes have very few Minkowski decompositions. A preliminary impleme...
متن کاملAn Improved Algorithm for Diophantine Equations in One Variable
We present a new algorithm for computing integer roots of univariate polynomials. For a polynomial f in Z[t] we can find the set of its integer roots in a time polynomial in the size of the sparse encoding of f . An algorithm to do this was given in [1]. The paper introduces a polynomial time method for computing sign of f at integral points, and then finds integer roots of f by isolating the r...
متن کامل